Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time
نویسندگان
چکیده
A graph is called t-perfect if its stable set polytope is defined by nonnegativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect.
منابع مشابه
Characterising claw-free t-perfect graphs
We characterise the class of all claw-free t-perfect graphs by forbidden t-minors. Moreover, we show that claw-free t-perfect graphs are 3-colourable. Such a colouring can be obtained in polynomial time.
متن کاملOn claw-free t-perfect graphs
A graph is called t-perfect, if its stable set polytope is defined by nonnegativity, edge and odd-cycle inequalities. We characterise the class of all claw-free t-perfect graphs by forbidden t-minors. Moreover, we show that claw-free t-perfect graphs are 3-colourable. Such a colouring can be obtained in polynomial time.
متن کاملInteger round-up property for the chromatic number of some h-perfect graphs
A graph is h-perfect if its stable set polytope can be completely described by nonnegativity, clique and odd-hole constraints. It is t-perfect if it furthermore has no clique of size 4. For every graph G and every c ∈ Z (G) + , the weighted chromatic number of (G, c) is the minimum cardinality of a multi-set F of stable sets of G such that every v ∈ V (G) belongs to at least cv members of F . W...
متن کاملMinimum Weighted Clique Cover on Strip-Composed Perfect Graphs
The only available combinatorial algorithm for the minimum weighted clique cover (mwcc) in claw-free perfect graphs is due to Hsu and Nemhauser [10] and dates back to 1984. More recently, Chudnovsky and Seymour [3] introduced a composition operation, strip-composition, in order to define their structural results for claw-free graphs; however, this composition operation is general and applies to...
متن کاملClaw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies claw-free circular-perfect graphs. First we prove that ifG is a connected claw-free circular-perfect graph with χ(G) > ω(G), then min{α(G), ω(G)} = 2. We use this resu...
متن کامل